Characterization and closure properties of linear ω-languages
نویسندگان
چکیده
منابع مشابه
Closure Properties of Ordered Languages
In this note, we solve questions regarding closure properties of ordered languages. Especially, ordered languages form a full abstract family of recursive languages which is neither intersection-nor complementation-closed.
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملClosure Properties of Minimalist Derivation Tree Languages
Recently, the question has been raised whether the derivation tree languages of Minimalist grammars (MGs; [14, 16]) are closed under intersection with regular tree languages [4, 5]. Using a variation of a proof technique devised by Thatcher [17], I show that even though closure under intersection does not obtain, it holds for every MG and regular tree language that their intersection is identic...
متن کاملClosure properties of locally finite omega-languages
Locally finite ω-languages, defined via second order quantifications followed by a first order locally finite sentence, were introduced by Ressayre in [Res88]. They enjoy very nice properties and extend ω-languages accepted by finite automata or defined by monadic second order sentences. We study here closure properties of the family LOCω of locally finite omega languages. In particular we show...
متن کاملComplexity of Topological Properties of Regular ω-Languages
We determine the complexity of topological properties (i.e., properties closed under the Wadge equivalence) of regular ω-languages by showing that they are typically NL-complete (PSPACEcomplete) for the deterministic Muller, Mostowski and Büchi automata (respectively, for the nondeterministic Rabin, Muller, Mostowski and Büchi automata). For the deterministic Rabin and Streett automata and for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00316-2